Ramsey Spanning Trees and Their Applications
نویسندگان
چکیده
منابع مشابه
Ramsey Spanning Trees and their Applications
The metric Ramsey problem asks for the largest subset S of a metric space that can be embedded into an ultrametric (more generally into a Hilbert space) with a given distortion. Study of this problem was motivated as a non-linear version of Dvoretzky theorem. Mendel and Naor [MN07] devised the so called Ramsey Partitions to address this problem, and showed the algorithmic applications of their ...
متن کاملRamsey Theory on Trees and Applications
This result was motivated by and applied to solve a problem in logic regarding canonical k-ary relations on the natural numbers. Ramsey’s Theorem has been extended in a myriad of directions, for instance, varying sizes of sets colored, varying the number of colors allowed, including infinitely many colors, and coloring more complex structures. Progress in Ramsey theory has led to progress in a ...
متن کاملOrderly Spanning Trees with Applications
We introduce and study orderly spanning trees of plane graphs. This algorithmic tool generalizes canonical orderings, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an orderly pair for any connected planar graph G, consisting of an embedded planar graph H isomorphic to G, and an orderly spanning ...
متن کاملBijections for Cayley trees, spanning trees, and their q-analogues
We construct a family of extremely simple bijections that yield Cayley’s famous formula for counting trees. The weight preserving properties of these bijections furnish a number of multivariate generating functions for weighted Cayley trees. Essentially the same idea is used to derive bijective proofs and q-analogues for the number of spanning trees of other graphs, including the complete bipar...
متن کاملA-trees and Their Applications
To most mathematicians and computer scientists the word "tree" conjures up, in addition to the usual image, the image of a connected graph with no circuits. We shall deal with various aspects and generalizations of these mathematical trees. (As Peter Shalen has pointed out, there will be leaves and foliations in this discussion, but they do not belong to the trees!) In the last few years variou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2020
ISSN: 1549-6325,1549-6333
DOI: 10.1145/3371039